Generalized Network Problems Yielding Totally Balanced Games
نویسندگان
چکیده
منابع مشابه
Agent Failures in Totally Balanced Games and Convex Games
We examine the impact of independent agents failures on the solutions of cooperative games, focusing on totally balanced games and the more speci c subclass of convex games. We follow the reliability extension model, recently proposed in [1] and show that a (approximately) totally balanced (or convex) game remains (approximately) totally balanced (or convex) when independent agent failures are ...
متن کاملProbe Matrix Problems: Totally Balanced Matrices
Let M be a class of 0/1-matrices. A 0/1/?-matrix A where the ?s induce a submatrix is a probe matrix of M if the ?s in A can be replaced by 0s and 1s such that A becomes a member of M. We show that for M being the class of totally balanced matrices, it can be decided in polynomial time whether A is a probe totally balanced matrix. On our route toward proving this main result, we also prove that...
متن کاملSubadditive and Homogeneous of Degree One Games Are Totally Balanced
A cooperative game with transferable utility is said to be homogeneous of degree one if for any integer m, the value of cloning m times all players at any given coalition, leads to m times the value of the original coalition. We show that this property coupled with sub-additivity, guarantee the non-emptyness of the core of the game and of all its subgames, namely the game is totally balanced. E...
متن کاملProduction-inventory games: A new class of totally balanced combinatorial optimization games
In this paper we introduce a new class of cooperative games that arise from production-inventory problems. Several agents have to cover their demand over a finite time horizon and shortages are allowed. Each agent has its own unit production, inventory-holding and backlogging cost. Cooperation among agents is given by sharing production processes and warehouse facilities: agents in a coalition ...
متن کاملGeneralized network design problems
Network design problems consist of identifying an optimal subgraph of a graph, subject to side constraints. In generalized network design problems, the vertex set is partitioned into clusters and the feasibility conditions are expressed in terms of the clusters. Several applications of generalized network design problems arise in the fields of telecommunications, transportation and biology. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1982
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.30.5.998